Discriminative Distance-Based Network Indices and the Tiny-World Property
نویسندگان
چکیده
Distance-based indices, including closeness centrality, average path length, eccentricity and average eccentricity, are important tools for network analysis. In these indices, the distance between two vertices is measured by the size of shortest paths between them. However, this measure has shortcomings. A well-studied shortcoming is that extending it to disconnected graphs (and also directed graphs) is controversial. The second shortcoming is that when this measure is used in real-world networks, a huge number of vertices may have exactly the same closeness/eccentricity scores. This restricts the applicability of these indices as they cannot distinguish vertices. The third shortcoming is that in many applications, the distance between two vertices not only depends on the size of shortest paths, but also on the number of shortest paths between them. In this paper, we develop a new distance measure between vertices of a graph that yields discriminative distance-based centrality indices. This measure is proportional to the size of shortest paths and inversely proportional to the number of shortest paths. We present algorithms for exact computation of the proposed discriminative indices. We then develop randomized algorithms that precisely estimate average discriminative path length and average discriminative eccentricity and show that they give (ε, δ )-approximations of these indices (ε ∈ R and δ ∈ (0, 1)). Finally, we preform extensive experiments over several real-world networks from different domains. We first show that compared to the traditional indices, discriminative indices have usually much more discriminability. We then show that our randomized algorithms can very precisely estimate average discriminative path length and average discriminative eccentricity, using only few samples. Our experiments reveal that real-world networks have usually a tiny average discriminative path length, bounded by a constant (e.g., 2). We refer to this property as the tiny-world property.
منابع مشابه
New amino acid indices based on residue network topology.
Amino acid indices are useful tools in bioinformatics. With the appearance of novel theory and technology, and the rapid increase of experimental data, building new indices to cope with new or unsolved old problems is still necessary. In this study, residue networks are constructed from the PDB structures of 640 representative proteins based on the distance between Calpha atoms with an 8 A cuto...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملDwarf Frankenstein is still in your memory: tiny code reuse attacks
Code reuse attacks such as return oriented programming and jump oriented programming are the most popular exploitation methods among attackers. A large number of practical and non-practical defenses are proposed that differ in their overhead, the source code requirement, detection rate and implementation dependencies. However, a usual aspect among these methods is consideration of the common be...
متن کاملApplication of Artificial Neural Network in Study Phenomenon of Landslide and Risk Modeling using Geographic Information System (GIS), Case Study: Alamoot Rood Watershed
One of the natural disasters that occurs in abundance in Iran, due to the geological structure, morphological and seismic conditions, and damages the lives and property of people is a landslide. Roodbar Alamoot watershed in the east of Qazvin province is a mountainous region with a high potential for occurrence of landslides. Because of their active status, there is also a growing trend of...
متن کاملMapping and Analyzing the Co-Authorship Network of Transgenic Researchers with a Network Analysis Approach
Background and Aim: Transgenic species are the ones whose genomes are genetically modified. The transgenic field is one of the areas that has a high importance and position in the world. Therefore, the aim of the present research is to draw and analyze the co-authorship network of researchers in transgenic subject area. Materials and Methods: The type of this research is descriptive and was ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.06227 شماره
صفحات -
تاریخ انتشار 2017